# 递归函数：自己调用自己
def fun(a):
    if a == 1:
        return a
    else:
        return a * fun(a - 1)


print(fun(6))

def fun1(n):
    if n==1 or n==2:
        return 1
    else:
        return fun1(n-1)+fun1(n-2)

print(fun1(5))

for i in range(6):
    print(fun1(i+1))